- Title
- Sparse representation using stepwise Tikhonov regularization with offline computations
- Creator
- Delgado, Ramón A.; Middleton, Richard H.
- Relation
- IEEE Signal Processing Letters Vol. 26, Issue 6, p. 873-877
- Publisher Link
- http://dx.doi.org/10.1109/LSP.2019.2907370
- Publisher
- Institute of Electrical and Electronics Engineers (IEEE)
- Resource Type
- journal article
- Date
- 2019
- Description
- This letter describes a novel algorithm for sparse reconstruction. The method uses offline computations to reduce the computational burden of online execution. The approach relies on the recently proposed stepwise Tikhonov regularization (STIR) method to implement forward selection procedures such as orthogonal least squares (OLS), orthogonal matching pursuit (OMP), and STIR. Numerical simulations show the efficacy of the proposed approach, which is competitive against state-of-the-art implementation of OLS and OMP.
- Subject
- greedy algorithms; least squares approximation; matching pursuit algorithms
- Identifier
- http://hdl.handle.net/1959.13/1401858
- Identifier
- uon:34973
- Identifier
- ISSN:1070-9908
- Rights
- © 2019 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
- Language
- eng
- Full Text
- Reviewed
- Hits: 1156
- Visitors: 1410
- Downloads: 271
| Thumbnail | File | Description | Size | Format | |||
|---|---|---|---|---|---|---|---|
| View Details Download | ATTACHMENT02 | Author final version | 340 KB | Adobe Acrobat PDF | View Details Download |